package leetcode


/**
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

Integers in each row are sorted in ascending from left to right.
Integers in each column are sorted in ascending from top to bottom.
Example:

Consider the following matrix:

[
[1,   4,  7, 11, 15],
[2,   5,  8, 12, 19],
[3,   6,  9, 16, 22],
[10, 13, 14, 17, 24],
[18, 21, 23, 26, 30]
]
Given target = 5, return true.

Given target = 20, return false.
 */
fun main(args: Array<String>) {

//    searchMatrixII()
}

/**
从右下角那个数字开始 开始找 ，如果 小 那么往上找，如果大，往右找
 passed
 */
fun searchMatrixII(matrix: Array<IntArray>, target: Int): Boolean {

    if (matrix.isEmpty() || matrix[0].isEmpty()) return false

    val rows = matrix.size
    val cols = matrix[0].size

    var r = matrix.size - 1
    var c = 0

    while (r in 0 until rows && c in 0 until cols) {
        if (target == matrix[r][c]) return true
        else if (target < matrix[r][c]) r--
        else c++
    }

    return false
}